Waiting time for a cyclic service system with priority
نویسندگان
چکیده
منابع مشابه
Waiting-time Approximations for Cyclic-service Systems with Mixed Service Strategies
An approximation method for mean waiting times in cyclic-service systems with a mixture of exhaustive/ gated/ I-limited service strategies is presented. The method provides a unification and generalization of some known good approximations for single strategies. The results of an exact analysis of the two-queue case where one queue is served exhaustively and the other queue I-limited, support t...
متن کاملQueues with waiting time dependent service
Motivated by service levels in terms of the waiting-time distribution seen, for instance, in call centers, we consider two models for systems with a service discipline that depends on the waiting time. The first model deals with a single server that continuously adapts its service rate based on the waiting time of the first customer in line. In the second model, one queue is served by a primary...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
A Queuing Model with Markovian Arrival and LCFS Priority System and General Time for Service
We consider a single server queuing system with repeated attempts in which customers arrive according a Markov arrival process (MAP) and with a LCFS PR discipline. The service times are independent and have a common general distribution. After service completion time the server initiates his search time with an arbitrary distribution function. We consider two cases where the maximum number of r...
متن کاملWaiting time characteristics in cyclic queues
In this paper we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times we present a simple exact analysis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1992
ISSN: 0307-904X
DOI: 10.1016/0307-904x(92)90051-4